#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, k;
    cin >> n >> k;

    V<int> w(n, 0);
    iota(ALL(w), 1ll);
    reverse(ALL(w));

    // do {
    int c = 0;
    map<int, int> mp;
    FOR(i, 0, n - 1) {
        FOR(j, i + 1, n - 1) {
            int t = w[i] - w[j];
            if (t >= 0 && (lowbit(t) == t)) {
                if (w[j] == 1) {

                    cout << t << ' ' << w[i] - w[j] << endl;
                }
                mp[w[j]]++;
                c++;
            }
        }
    }
    for (auto [x, y] : mp) cout << x << ' ' << y << endl;
    if (c == k) {
        for (auto x : w) cout << x << ' ';
        cout << endl;
    }
    // } while (next_permutation(ALL(w)));
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}